import math as mt
from collections import defaultdict,deque
from posixpath import split
import sys
from bisect import bisect_right as b_r
from bisect import bisect_left as b_l
mod=1000000007
INT_MAX = sys.maxsize-1
INT_MIN = -sys.maxsize
def solve():
x,y=map(int,input().split())
maxi=max(abs(x),abs(y))
mini=min(abs(x),abs(y))
if(x<0 and y<0):
print(-(maxi+mini),0,0,-(maxi+mini))
elif(x<0 and y>=0):
print(-(maxi+mini),0,0,(maxi+mini))
elif(x>=0 and y<0):
print(0,-(maxi+mini),(maxi+mini),0)
else:
print(0,(maxi+mini),(maxi+mini),0)
if __name__ == "__main__":
solve()#include<bits/stdc++.h>
#define aint(x) (x).begin(), (x).end()
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7;
#define takeInput(v) for(auto& x:v) cin>>x;
#define print(v) for(auto x:v) cout<<x<<' '; cout<<endl;
#define int long long int
#define F first
#define S second
#define pb push_back
#define yy "YES"
#define nn "NO"
using namespace std;
void solve (){
int x,y; cin>>x>>y;
if(x >0&&y>0){
cout<<0<<" "<<x+y<<" "<<x+y<<" "<<0;
}
if(x > 0 && y < 0)
cout<<0<<" "<<(y-x)<<" "<<x-y<<" "<<0;
if(x < 0 && y > 0)
cout<<(x-y)<<" "<<0<<" "<<0<<" "<<y-x;
if(x < 0 && y < 0)
cout<<(x+y)<<" "<<0<<" "<<0<<" "<<y+x;
}
int32_t main(){
// int t;
// cin>>t;
// while(t--){
// solve();
// }
solve();
return 0;
}938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |